computation historyの例文

• Computation histories are more commonly used in reference to Turing machines.
• The reduction uses the concept of a " computation history ", a string describing an entire computation of a Turing machine.
• The computation history of the mis鑢e version of Sprouts is very similar to that of the normal version, with the same people involved.
• Then, because Kleene's T predicate is primitive recursive, it is possible for a primitive recursive function to verify that " j " is indeed a computation history as required.
• A CFG can be constructed that generates all strings that are not accepting computation histories for a particular Turing machine on a particular input, and thus it will accept all strings only if the machine doesn't accept that input.